Manifold Denoising
نویسندگان
چکیده
We consider the problem of denoising a noisily sampled submanifold M in R, where the submanifold M is a priori unknown and we are only given a noisy point sample. The presented denoising algorithm is based on a graph-based diffusion process of the point sample. We analyze this diffusion process using recent results about the convergence of graph Laplacians. In the experiments we show that our method is capable of dealing with non-trivial high-dimensional noise. Moreover using the denoising algorithm as pre-processing method we can improve the results of a semi-supervised learning algorithm.
منابع مشابه
Learning a speech manifold for signal subspace speech denoising
We present a method for learning a low-dimensional manifold for speech from clean speech samples in high-dimensional space. Using this manifold, we perform speech denoising by projecting noisy speech onto the manifold to remove nonspeech components. This method of denoising classifies our algorithm as a signal subspace denoising method, where highdimensional noisy data is projected onto the sig...
متن کاملVibration Sensor Data Denoising Using a Time-Frequency Manifold for Machinery Fault Diagnosis
Vibration sensor data from a mechanical system are often associated with important measurement information useful for machinery fault diagnosis. However, in practice the existence of background noise makes it difficult to identify the fault signature from the sensing data. This paper introduces the time-frequency manifold (TFM) concept into sensor data denoising and proposes a novel denoising m...
متن کاملGraph-Based Manifold Frequency Analysis for Denoising
We propose a new framework for manifold denoising based on processing in the graph Fourier frequency domain, derived from the spectral decomposition of the discrete graph Laplacian. Our approach uses the Spectral Graph Wavelet transform in order to perform non-iterative denoising directly in the graph frequency domain, an approach inspired by conventional wavelet-based signal denoising methods....
متن کاملCorrection by Projection: Denoising Images with Generative Adversarial Networks
Generative adversarial networks (GANs) transform lowdimensional latent vectors into visually plausible images. If the real dataset contains only clean images, then ostensibly, the manifold learned by the GAN should contain only clean images. In this paper, we propose to denoise corrupted images by finding the nearest point on the GAN manifold, recovering latent vectors by minimizing distances i...
متن کاملKarcher means for shape and image denoising
In the context on shape and image modeling by manifold learning, we focus on the problem of denoising. A set of shapes or images being known through given samples, we capture its structure thanks to the diffusion maps method. Denoising a new element classically boils down to the key-problem of pre-image determination, i.e. recovering a point, given its embedding. We propose to model the underly...
متن کاملTotal Variation Regularization for Manifold-Valued Data
We consider total variation (TV) minimization for manifold-valued data. We propose a cyclic proximal point algorithm and a parallel proximal point algorithm to minimize TV functionals with -type data terms in the manifold case. These algorithms are based on iterative geodesic averaging which makes them easily applicable to a large class of data manifolds. As an application, we consider denoisin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006